home *** CD-ROM | disk | FTP | other *** search
- Path: tank.news.pipex.net!pipex!warwick!kinguni!usenet
- From: Paul Giaccone <cs_j675>
- Newsgroups: comp.lang.c++
- Subject: Relative times taken by mathematical operations
- Date: 12 Mar 1996 16:29:28 GMT
- Organization: Kingston University, Kingston-upon-Thames
- Message-ID: <4i48p8$prb@mercury.kingston.ac.uk>
- NNTP-Posting-Host: vulture.dcs.king.ac.uk
- Mime-Version: 1.0
- Content-Type: text/plain; charset=us-ascii
- Content-Transfer-Encoding: 7bit
- X-Mailer: Mozilla 1.12 (X11; I; SunOS 4.1.3 sun4m)
- X-URL: news:comp.lang.c++
-
- I have several accumulated several algorithms for solving a simple geometric
- problem that is part of a much larger piece of work. I would like to calculate
- which is the likely to be the fastest by counting the elementary mathematical
- operations that make them up, these being the four arithmetical operations and
- the square root and inverse tangent operations.
-
- I don't need to know exact numbers of clock cycles for each of these but I
- would like to know the time ratios between them (eg addition : multiplication :
- square root : arctan = 1 : 4 : 10 : 25).
-
- If it helps, I'm using g++ running under Unix.
-
- Thanks for any help (I would prefer e-mail replies).
-
- Paul Giaccone
- k941319@kingston.ac.uk
- Vision Group
- Kingston University
-
-